Persistent homology transform for modeling shapes and surfaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent homology and partial similarity of shapes

The ability to perform shape retrieval based not only on full similarity, but also partial similarity is a key property for any content-based search engine. We prove that persistence diagrams can reveal a partial similarity between two shapes by showing a common subset of points. This can be explained using the MayerVietoris formulas that we develop for ordinary, relative and extended persisten...

متن کامل

Persistent homology and partial matching of shapes

The ability to perform not only global matching but also partial matching is investigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and I will illustrate some results about persistence diagrams of occluded shapes and partial shapes. The main tool is a Mayer-Vietoris for...

متن کامل

Metrics for comparing neuronal tree shapes based on persistent homology

As more and more neuroanatomical data are made available through efforts such as NeuroMorpho.Org and FlyCircuit.org, the need to develop computational tools to facilitate automatic knowledge discovery from such large datasets becomes more urgent. One fundamental question is how best to compare neuron structures, for instance to organize and classify large collection of neurons. We aim to develo...

متن کامل

Modeling Collaborations with Persistent Homology

In this paper we describe a model based on persistent homology that describes interactions between mathematicians in terms of collaborations. Some ideas from classical data analysis are used.

متن کامل

Coreduction homology algorithm for inclusions and persistent homology

We present an algorithm for computing the homology of inclusion maps which is based on the idea of coreductions and leads to significant speed improvements over current algorithms. It is shown that this algorithm can be extended to compute both persistent homology and an extension of the persistence concept to two-sided filtrations. In addition to describing the theoretical background, we prese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Inference

سال: 2014

ISSN: 2049-8764,2049-8772

DOI: 10.1093/imaiai/iau011